Local Maps: New Insights into Mobile Agent Algorithms
نویسنده
چکیده
In this paper, we study the complexity of computing with mobile agents having small local knowledge. In particular, we show that the number of mobile agents and the amount of local information given initially to agents can significantly influence the time complexity of resolving a distributed problem. Our results are based on a generic scheme allowing to transform a message passing algorithm, running on an n-node graph G, into a mobile agent one. By generic, we mean that the scheme is independent of both the message passing algorithm and the graph G. Our scheme, coupled with a well-chosen clustered representation of the graph, induces Õ(1)† ratio between the time complexity of the obtained mobile agent algorithm and the time complexity of the original message passing counterpart, while using Õ(n) mobile agents. If only k agents are allowed (k is an integer parameter), then we show that the time ratio is O(n/ √ k). As a consequence, we show that any global labeling function of G can be computed by exactly n mobile agents knowing their n -neighborhood in Õ(D) time, D is the diameter of the graph and is an arbitrary small constant. We apply our generic results for the fundamental problem of computing a leader (resp. a BFS tree) under the additional restriction of Õ(1) (resp. Õ(n)) bit memory per agent, and obtain Õ(D) time algorithms. Key-words: Mobile agents, locality, local maps. ∗ supoprted by the DOLPHIN project team. † e O(f(n)) = log n · f(n) Local Maps: New Insights into Mobile Agent Algorithms Résumé : In this paper, we study the complexity of computing with mobile agents having small local knowledge. In particular, we show that the number of mobile agents and the amount of local information given initially to agents can significantly influence the time complexity of resolving a distributed problem. Our results are based on a generic scheme allowing to transform a message passing algorithm, running on an n-node graph G, into a mobile agent one. By generic, we mean that the scheme is independent of both the message passing algorithm and the graph G. Our scheme, coupled with a well-chosen clustered representation of the graph, induces Õ(1)‡ ratio between the time complexity of the obtained mobile agent algorithm and the time complexity of the original message passing counterpart, while using Õ(n) mobile agents. If only k agents are allowed (k is an integer parameter), then we show that the time ratio is O(n/ √ k). As a consequence, we show that any global labeling function of G can be computed by exactly n mobile agents knowing their n -neighborhood in Õ(D) time, D is the diameter of the graph and is an arbitrary small constant. We apply our generic results for the fundamental problem of computing a leader (resp. a BFS tree) under the additional restriction of Õ(1) (resp. Õ(n)) bit memory per agent, and obtain Õ(D) time algorithms. Mots-clés : Mobile agents, locality, local maps. ‡ e O(f(n)) = log n · f(n) Local Maps: New Insights into Mobile Agent Algorithms 3
منابع مشابه
A Cellular Automaton Based Algorithm for Mobile Sensor Gathering
In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...
متن کاملIntegrating terrain maps into a reactive navigation strategy
This paper presents a new method for integrating terrain maps into a reactive navigation strategy offield mobile robots operating on rough terrain. The method incorporates the Regional Traversabilify Map, a f u z v map representation of traversal difficulty of the regional terrain, into the navigation logic. A mapbased regional navigation behavior provides speed and direction recommendations ba...
متن کاملLocation aware applications for smart cities with Google maps and GIS tools
—The release of internet mapping API like Google maps had changed the way many location aware systems works, this paper will look into how location visualization tools can make use of this new way in providing location service. With the emergence of wireless broadband internet in increasing number of cities, digital cities are being developed all over the world where public services could be ho...
متن کاملDALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs
Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...
متن کاملExplorative max-sum for teams of mobile sensing agents
Multi-agent applications that include teams of mobile sensing agents are challenging since they are inherently dynamic and a single movement of a mobile sensor can change the problem that the whole team is facing. While agents select their positions with respect to the information available to them in their local environment, by moving to a different location they can reveal new information, e....
متن کامل